Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes

We prove that for d ≥ 3, the 1-skeleton of any (d− 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette’s lower bound inequalities for boundary complexes of simplicial polytopes ([4],[3]) hold for every 2-CM complex of dimension ≥ 2 (see Kalai [8]). Moreover, the initial part (g0, g1, g2) of the g-vector of a 2-CM complex (of dimensio...

متن کامل

A Lower Bound Theorem

Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.

متن کامل

An Improved Lower Bound for Folkman’s Theorem

Folkman’s theorem asserts that for each k ∈ N, there exists a natural number n = F (k) such that whenever the elements of [n] are two-coloured, there exists a set A ⊂ [n] of size k with the property that all the sums of the form ∑ x∈B x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erdős and Spencer showed that F (k) ≥ 2ck2/ log , where c > 0 is an ...

متن کامل

Lower bound theorem for normal pseudomanifolds

In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup’s generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected tria...

متن کامل

Lower Bound Theorems and a Generalized Lower Bound Conjecture for balanced simplicial complexes

A (d − 1)-dimensional simplicial complex is called balanced if its underlying graph admits a proper d-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we prove the balanced analog of the celebrated Lower Bound Theorem for normal pseudomanifolds and characterize the case of equality; we introduce and ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2007

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-007-9017-y